Parameterized algorithmics for linear arrangement problems
نویسنده
چکیده
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for these problems. However, the analysis of these algorithms is sometimes not so easy.
منابع مشابه
Reflections on Multivariate Algorithmics and Problem Parameterization
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops into the field of multivariate algorithmics. Correspondingly, we describe how to perform a systematic investigation and exploitation of the “parameter space” of computationally hard problems. Algorithms and Complexity;...
متن کاملKernelization Lower Bounds for Finding Constant Size Subgraphs
Kernelization is an important tool in parameterized algorithmics. The goal is to reduce the input instance of a parameterized problem in polynomial time to an equivalent instance of the same problem such that the size of the reduced instance only depends on the parameter and not on the size of the original instance. In this paper, we provide a first conceptual study on limits of kernelization f...
متن کاملParameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other side. Typical computational problems studied in this field include the vulnerability of voting procedures against attacks, or preference aggregati...
متن کاملParametric Duality: Kernel Sizes & Algorithmics
We derive certain properties for problems which are parameterized tractable both in their “primal” and in their “dual” parameterization. In particular, we derive the first ever lower bounds result for kernel sizes of parameterized problems. We discuss various consequences of this result. Moreover, we explain how to get improved non-parameterized algorithms from known parameterized algorithms by...
متن کاملMultivariate Algorithmics for NP-Hard String Problems
String problems arise in various applications ranging from text mining to biological sequence analysis. Many string problems are NP-hard. This motivates the search for (fixed-parameter) tractable special cases of these problems. We survey parameterized and multivariate algorithmics results for NP-hard string problems and identify challenges for future research.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 156 شماره
صفحات -
تاریخ انتشار 2008